排序方式: 共有85条查询结果,搜索用时 375 毫秒
11.
12.
应用载荷直接获取航天器平台的时间和公共测量信息,并不能完全满足载荷的高精度时间基准和共用信息使用需求。一些功能载荷具备向外输出高精度时间和状态测量信息的能力,但硬件接口资源有限。将功能载荷作为FC-AE-1553光纤网络的一个节点,在FC-AE-1553光纤网络中叠加IEEE 1588v2时间同步协议,功能载荷的高精度时钟源能同步给有需求的其他载荷。并在时间同步的前提下,将功能载荷的测量数据如定位数据、姿态数据和轨道数据等共用信息同步发送至网络上的其他载荷节点。通过时间同步与同步发送机制,解决了各载荷对高精度时间和共用信息的需求,弥补了专用信息硬件接口资源的不足。结果表明,与直接利用航天器平台的信息源相比较,当时钟源和共用信息来自功能载荷时,FC-AE-1553网络时间同步之后的时间基准精度和共用信息利用性能高出3个数量级,载荷获取的UTC时间精度达到百纳 相似文献
13.
14.
从软—硬件协同设计的角度出发 ,提出了软件无线电系统中码元同步的一种实现方案。该方案以信号插值为理论基础 ,用软件实现整个码元同步过程。其特点是以估计性能更佳的最小均方滤波器替代传统的多项式插值滤波器 ,并利用软件实现时可以进行大批量数据缓存的优势 ,提出能量检测算法 ,以克服半码元周期传输延迟时出现的高误码率问题 相似文献
15.
We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
16.
In this article, we propose a branch‐and‐price‐and‐cut (BPC) algorithm to exactly solve the manpower routing problem with synchronization constraints (MRPSC). Compared with the classical vehicle routing problems (VRPs), the defining characteristic of the MRPSC is that multiple workers are required to work together and start at the same time to carry out a job, that is, the routes of the scheduling subjects are dependent. The incorporation of the synchronization constraints increases the difficulty of the MRPSC significantly and makes the existing VRP exact algorithm inapplicable. Although there are many types of valid inequalities for the VRP or its variants, so far we can only adapt the infeasible path elimination inequality and the weak clique inequality to handle the synchronization constraints in our BPC algorithm. The experimental results at the root node of the branch‐and‐bound tree show that the employed inequalities can effectively improve the lower bound of the problem. Compared with ILOG CPLEX, our BPC algorithm managed to find optimal solutions for more test instances within 1 hour. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 138–171, 2016 相似文献
17.
MPPFortran是由Cray公司推出的一种较有代表性的数据并行语言,本文首先介绍了MPPFortran的主要特点,然后,以该语言为例,对面向MPP系统程序自动并行化的主要内容进行了初步的探讨。 相似文献
18.
19.
针对固定时间延迟及时变时间延迟系统,提出了同步控制方案,在实现同步后能有效解决传输时延对保密通信的影响.利用线性矩阵不等式方法设计了同步控制器,应用Lyapunov方法分析了同步误差的收敛性,并运用Schur补引理证明了全局渐近稳定点的存在. 相似文献
20.
尺度不变特征变换描述子已经应用于数字图像水印的构造,但图像存在相似区域时易造成误匹配问题,基于此提出一种改进的RIT—SIFT数字图像水印算法.水印嵌入时先对图像进行分块,然后将水印分别嵌入子块的非下采样Contourlet变换低频子带中,既简化了水印嵌人又增加了嵌入容量.图像匹配时利用SIFT算法在原始图像中寻找局部特征点,将旋转不变纹理特征信息融合到传统SIFT特征向量中,更加全面地描述图像信息,提高了匹配精度.实验结果表明,提出的算法是有效的,对全局和局部几何攻击、组合攻击以及常规攻击均具有很好的鲁棒性. 相似文献